An Efficient Spatial Search Method Based on SG-Tree
نویسندگان
چکیده
To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named Space Grid Tree (SG-Tree) based on Peano Space-Filling Curve (SFC) to index the region of object. By appropriate linearization strategy, the bounding box of a spatial object can be presented by a union of mutually disjoint hypercube grids with different granularity, and only the object’s oid, i.e. the identifier which is used to refer to this object in the database, is registered on the nodes relative to these grids. The overlapping queries of spatial objects can be operated real-time directly on SG-Tree. Experiments show that SG-Tree is feasible and efficient to solve the overlapping search of multidimensional spatial objects.
منابع مشابه
Ball*-tree: Efficient spatial indexing for constrained nearest-neighbor search in metric spaces
Emerging location-based systems and data analysis frameworks requires efficient management of spatial data for approximate and exact search. Exact similarity search can be done using space partitioning data structures, such as KD-tree, R*-tree, and ball-tree. In this paper, we focus on ball-tree, an efficient search tree that is specific for spatial queries which use euclidean distance. Each no...
متن کاملStructural Reliability: An Assessment Using a New and Efficient Two-Phase Method Based on Artificial Neural Network and a Harmony Search Algorithm
In this research, a two-phase algorithm based on the artificial neural network (ANN) and a harmony search (HS) algorithm has been developed with the aim of assessing the reliability of structures with implicit limit state functions. The proposed method involves the generation of datasets to be used specifically for training by Finite Element analysis, to establish an ANN model using a proven AN...
متن کاملA Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network
Abstract Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...
متن کاملBroadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملAn Efficient Method for k Nearest Neighbor Searching in Obstructed Spatial Databases
Currently, there has been an increasing development in the area of location-based service. An important type of query in this area is k nearest neighbor (kNN) query, which retrieves the top k nearest neighbors based on the user's position. Although a wide spectrum of work has been conducted on this query type, most of these studies focus on the ideal Euclidean plane without obstacles considered...
متن کامل